Airway Tree Extraction with Locally Optimal Paths
نویسندگان
چکیده
This paper proposes a method to extract the airway tree from CT images by continually extending the tree with locally optimal paths. This is in contrast to commonly used region growing based approaches that only search the space of the immediate neighbors. The result is a much more robust method for tree extraction that can overcome local occlusions. The cost function for obtaining the optimal paths takes into account of an airway probability map as well as measures of airway shape and orientation derived from multi-scale Hessian eigen analysis on the airway probability. Significant improvements were achieved compared to a region growing based method, with up to 36% longer trees at a slight increase of false positive rate.
منابع مشابه
Globally-Optimal Anatomical Tree Extraction from 3D Medical Images Using Pictorial Structures and Minimal Paths
Extracting centerlines of anatomical trees (e.g., vasculature and airways) from 3D medical images is a crucial preliminary step for various medical applications. We propose an automatic tree extraction method that leverages prior knowledge of tree topology and geometry and ensures globally-optimal solutions. We define a pictorial structure with a corresponding cost function to detect tree bifur...
متن کاملFractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring problem in trees. We consider the class of locally-symmetric sets of paths on binary trees and prove that any such set of paths has a fractional coloring of cost at most 1.367L, where L denotes the load of the set of paths. Using this result, we obtain a randomized algorit...
متن کاملBoundary Regularity of Optimal Transport Paths
The optimal transport problem aims at finding an optimal way to transport a given probability measure into another. In contrast to the wellknown Monge-Kantorovich problem, the ramified optimal transportation problem aims at modeling a tree-typed branching transport network by an optimal transport path between two given probability measures. An essential feature of such a transport path is to fa...
متن کاملIntrathoracic Airway Tree Segmentation from CT Images Using a Fuzzy Connectivity Method
Introduction: Virtual bronchoscopy is a reliable and efficient diagnostic method for primary symptoms of lung cancer. The segmentation of airways from CT images is a critical step for numerous virtual bronchoscopy applications. Materials and Methods: To overcome the limitations of the fuzzy connectedness method, the proposed technique, called fuzzy connectivity - fuzzy C-mean (FC-FCM), utilized...
متن کاملMining approximate patterns with frequent locally optimal occurrences
We propose a novel frequent approximate pattern mining that suits estimation of occurrence regions. Given a string s, our mining enumerates its substrings that locally optimally match many substrings of s. We show an algorithm for this problem in which candidate patterns are generated without duplication using the suffix tree of s. This problem can be extended to the problem of enumerating appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention
دوره 12 Pt 2 شماره
صفحات -
تاریخ انتشار 2009